OLD AND NEW PROBLEMS AND RESULTS IN COMBINATORIAL NUMBER THEORY : van der WAERDEN'S THEOREM AND RELATED TOPICS

نویسندگان

  • P Erdős
  • R L Graham
چکیده

The present paper represents essentially a chapter in a forthcoming "Monographie" in the l Enseignement Mathématique series i ) with the title "Old and new problems and results in combinatorial number theory" by the above authors . Basically we will discuss various problems in elementary number theory, most of which have a combinatorial flavor . In general we will avoid classical problems, just mentioning references for the interested reader. We will almost never give proofs but on the other hand we will try to give as exact references as we can . We will restrict ourselves mostly to problems on which we worked for two reasons : (i) In order not to make the paper too long ; (ii) We may know more about them than the reader . Both the difficulty and importance of the problems discussed are very variable-some are only exercises while others are very difficult or even hopeless and may have important consequences or their eventual solution may lead to important advances and the discovery of new methods . Some of the problems we think are difficult may turn out to be trivial after all -this has certainly happened before in the history of the world with anyone who tried to predict the future . Here is an amusing case . Hilbert lectured in the early 1920's on problems in mathematics and said something like this-probably all of us will see the proof of the Riemann hypothesis, some of us (but probably not I) will see the proof of Fermat's last theorem, but none of us will see the proof that 2 ,/2 is transcendental . In the audience was Siegel, whose deep research contributed decisively to the proof by Kusmin a few years later of the transcendence of 2 ,/2 . In fact shortly thereafter Gelfond and a few weeks later Schneider independently proved that cc" is transcendental if a and /3 are algebraic, /3 is irrational and a # 0, 1 .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal Problems in Number Theory , Combinatorics And Geometry

During my long life I wrote many papers on these subjects [1]. There are many fascinating and difficult unsolved problems in all three of these topics. I have to organize the problems in some order. This is not an easy t l sk and anyway not one of my strong points. In number theory I will mainly discuss questions related to van der NVaerden's theorem on long arithmetic progressions and problems...

متن کامل

Rational Approximation on the Positive Real Axis

Introduction Rational Chebyshev approximation to reciprocals of certain entire functions by reciprocals of polynomials on the positive real axis has recently attracted the attention of many mathematicians . By developing certain new methods of approach we successfully attacked ([3]-[6]) some of the related problems . This paper is a continuation of our earlier papers ([3]-[6] ) . The results of...

متن کامل

On Simultaneous Rigid E - Uni cation

Veanes, M. 1997: On Simultaneous Rigid E-Uni cation, Uppsala Theses in Computing Science 29. 122pp. Uppsala. ISSN 0283-359X, ISBN 91-506-1217-4. Automated theorem proving methods in classical logic with equality that are based on the Herbrand theorem, reduce to a problem called Simultaneous Rigid E-Uni cation, or SREU for short. Recent developments show that SREU has also close connections with...

متن کامل

Randomness Test , over a General Space

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These restrictions seem artificial. Some progress has been made to extend the theory to arbitrary Bernoulli distributions (by Martin-Löf), and to arbitrary distributions (...

متن کامل

Uniform test of algorithmic randomness over a general space

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These restrictions seem artificial. Some progress has been made to extend the theory to arbitrary Bernoulli distributions (by Martin-Löf), and to arbitrary distributions (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1980